Òøöö Öö Ò Îîööö Blockin Blockinøøóò a Lattice Theory for Solving Games of Imperfect Information
نویسندگان
چکیده
In this paper, we propose a fixed point theory to solve games of imperfect information. The fixed point theory is defined on the lattice of antichains of sets of states. Contrary to the classical solution proposed by Reif [Rei84], our new solution does not involve determinization. As a consequence, it is readily applicable to classes of systems that do not admit determinization. Notable examples of such systems are timed and hybrid automata. As an application, we show that the discrete control problem for games of imperfect information defined by rectangular automata is decidable. This result extends a result by Henzinger and Kopke in [HK99].
منابع مشابه
Òøöö Öö Ò Îîööö Blockin Blockinøøóò on the Complexity of Partial Order Trace Model Checking * Thierry Massart Cédric Meuter
متن کامل
Òøöö Öö Ò Îîööö Blockin Blockinøøóò Algorithms for Omega-regular Games with Imperfect Information
We study observation-based strategies for two-player turnbased games on graphs with omega-regular objectives. An observationbased strategy relies on imperfect information about the history of a play, namely, on the past sequence of observations. Such games occur in the synthesis of a controller that does not see the private state of the plant. Our main results are twofold. First, we give a fixe...
متن کاملÒøöö Öö Ò Îîööö Blockin Blockinøøóò an Introduction to the Tool Ticc ⋆
This paper is a tutorial introduction to the sociable interface model of [12] and its underlying tool TICC [1]. The paper starts with a survey of the theory of interfaces and then introduces the sociable interface model that is a game-based model with rich communication primitives to facilitate the modeling of software and distributed systems. The model and its main features are then intensivel...
متن کاملÒøöö Öö Ò Îîööö Blockin Blockinøøóò Robustness and Implementability of Timed Automata
The Almost ASAP semantics is a parameterized semantics for Timed Automata that has been developped in [DDR05] to cope with the reaction delay of the controller. That semantics is implementable provided there exists strictly positive values for the parameters ∆ and ε for which the strategy is correct. In this paper, we define the implementability problem to be the question of the existence of su...
متن کاملÒøöö Öö Ò Îîööö Blockin Blockinøøóò
Visibly pushdown automata have been recently introduced by Alur and Madhusudan as a subclass of pushdown automata. This class enjoys nice properties such as closure under all Boolean operations and the decidability of language inclusion. Along the same line, we introduce here visibly pushdown transducers as a subclass of pushdown transducers. We study properties of those transducers and identif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006